Fast algorithms: A multitape turing machine implementation
نویسندگان
چکیده
منابع مشابه
A small fast universal Turing machine
We present a small time-efficient universal Turing machine with 5 states and 6 symbols. This Turing machine simulates our new variant of tag system. It is the smallest known universal Turing machine that simulates Turing machine computations in polynomial time.
متن کاملA physical implementation of the Turing machine accessed through Web
A Turing machine has an important role in education in the field of computer science, as it is a milestone in courses related to automata theory, theory of computation and computer architecture. Its value is also recognized in the Computing Curricula proposed by the Association for Computing Machinery (ACM) and IEEE Computer Society. In this paper we present a physical implementation of the Tur...
متن کاملAn Embryonics Implementation of a Self-Replicating Universal Turing Machine
The goal of this contribution is to describe how a universal Turing machine was embedded into a hardware system in order to verify the computational universality of a novel architecture. This implementation was realized with a multicellular automaton inspired by the embryonic development of living organisms. In such an architecture, every artificial “cell” contains a complete copy of the descri...
متن کاملA Kinematic Turing Machine
A Turing Machine in a three dimensional discrete space environment containing movable cubic parts is described. All of the cubic parts are identical in function. The only function that a part performs is to move a neighbouring part by one unit. Parts can be connected to neighbouring parts. When one part moves, parts that it is connected to also move. An example program for the Turing Machine is...
متن کاملAlan Turing Universal Turing Machine
In recent years, much research has been devoted to the synthesis of gigabit switches; on the other hand, few have explored the refinement of hash tables. In fact, few cryptographers would disagree with the improvement of the lookaside buffer. In this work, we use signed technology to show that architecture and superblocks are usually incompatible.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1996
ISSN: 0377-0427
DOI: 10.1016/0377-0427(96)80473-0